Papers with fully supervised

5 papers
Multilingual Relation Classification via Efficient and Effective Prompting (2022.emnlp-main)

Copied to clipboard

Challenge: Existing work on prompt-based multilingual relation classification (RC) uses pre-trained language models with limited resources.
Approach: They propose a prompt-based multilingual relation classification method that constructs relation triples from relation triple labels and requires minimal translation for the class labels.
Outcome: The proposed method outperforms baselines in English-task training in cross-lingual settings and in fully supervised and few-shot scenarios.
A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling (2022.emnlp-main)

Copied to clipboard

Challenge: Existing document-level relation extraction methods focus on fully supervised scenarios but in real-world, incomplete labeling is a common problem because the number of entity pairs grows quadratically with the number.
Approach: They propose a positive-unlabeled learning framework for document-level relation extraction (RE) that uses shift and squared ranking loss positive- unlabeles (SSR-PU) learning to solve incomplete labeling problem.
Outcome: The proposed framework outperforms state-of-the-art methods under fully supervised and extremely unlabeled conditions and achieves 14 F1 points over the baseline with incomplete labeling.
AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuning (2022.emnlp-main)

Copied to clipboard

Challenge: Standard fine-tuning of large pre-trained language models requires updating hundreds of millions to billions of parameters and storing a large copy of the PLM weights for every task.
Approach: They propose a parameter-efficient fine-tuning technique where small trainable components are injected into the PLM and updated during fine-uning.
Outcome: The proposed method outperforms SOTA parameter-efficient fine-tuning and full model fine-uning on GLUE development set with RoBERTa-large encoder.
Prompt-learning for Fine-grained Entity Typing (2022.findings-emnlp)

Copied to clipboard

Challenge: Extensive experiments on fine-grained entity typing under fully supervised, few-shot, and zero-shot settings show the effectiveness of prompt-learning.
Approach: They propose a prompt-learning pipeline that stimulates versatile knowledge of pre-trained language models (PLMs) by constructing entity-oriented verbalizers and templates and conducting masked language modeling.
Outcome: The proposed approach can be applied to fine-grained entity typing in fully supervised, few-shot, and zero-shot scenarios.
Scaling Performance and Low-Resource Annotation with Many-Shot In-Context Learning for Named Entity Recognition (2026.findings-acl)

Copied to clipboard

Challenge: Existing studies on ICL for Named Entity Recognition (NER) have mainly explored few-shot settings, but the potential of scaling to hundreds of demonstrations has not been thoroughly investigated.
Approach: They evaluate various LLMs across multiple domains using hundreds of ICL examples and then assess the feasibility of using many-shot ICL as a data annotation framework.
Outcome: The proposed framework can be scaled to hundreds of examples and annotate and refining data for low-resource NER tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations